An Algorithm for Computing m-Tight Error Linear Complexity of Sequences over GF (p) with Period p
نویسندگان
چکیده
The linear complexity (LC) of a sequence has been used as a convenient measure of the randomness of a sequence. Based on the theories of linear complexity, k-error linear complexity, the minimum error and the k-error linear complexity profile, the notion of m-tight error linear complexity is presented. An efficient algorithm for computing m-tight error linear complexity is derived from the algorithm for computing k-error linear complexity of sequences over GF(p) with period p, where p is a prime. The validity of the algorithm is shown. The algorithm is also realized with C language, and an example is presented to illustrate the algorithm.
منابع مشابه
An Algorithm for Computing m-Tight Error Linear Complexity of Sequences over GF(p^m) with Period p^m
The linear complexity (LC) of a sequence has been used as a convenient measure of the randomness of a sequence. Based on the theories of linear complexity, k-error linear complexity, the minimum error and the k-error linear complexity profile, the notion of m-tight error linear complexity is presented. An efficient algorithm for computing m-tight error linear complexity is derived from the algo...
متن کاملAn algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)
The union cost is used, so that an efficient algorithm for computing the k-error linear complexity of a sequence with period 2p n over GF(q) is presented, where p and q are odd primes, and q is a primitive root of modulo p 2 .
متن کاملFast Algorithms for Determining the Linear Complexity of Period Sequences
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p over GF(q) , where p is an odd prime, q is a prime and a primitive root modulo p; and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period pq over GF(q), the other is the algorithm fo...
متن کاملA Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3)
Jianqin Zhou (Dept. of Computer Science, Anhui University of Technology, Ma’anshan 243002, P. R. China) (E-mail: [email protected]) Abstract: A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m , where p is a prime, q is a prime and a primitive root modulo p. The algorithm presented here generalizes...
متن کاملFast algorithms for determining the linear complexities of sequences over GF (p) with the period 3n
In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF (p)(any positive integer m) with the period 3n (n and p−1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm...
متن کامل